Automatic Decision of Piano Fingering Based on a Hidden Markov Models
نویسندگان
چکیده
This paper proposes a Hidden Markov Model (HMM)-based algorithm for automatic decision of piano fingering. We represent the positions and forms of hands and fingers as HMM states and model the resulted sequence of performed notes as emissions associated with HMM transitions. Optimal fingering decision is thus formulated as Viterbi search to find the most likely sequence of state transitions. The proposed algorithm models the required efforts in pressing a key with a finger followed by another key with another finger, and in two-dimensional positioning of fingers on the piano keyboard with diatonic and chromatic keys. Fundamental functionality of the algorithm was verified through experiments with real piano pieces. This framework can be extended to polyphonic music containing chords.
منابع مشابه
Automatic Piano Reduction from Ensemble Scores Based on Merged-Output Hidden Markov Model
We discuss automated piano reduction from ensemble scores based on stochastic models of piano fingering and reduction process. Music arrangement including piano transcription is an important compositional technique, automation of which creates a challenging research field. As a starting point, we aim at a simple case of piano reduction which is playable and sounds similar to the original ensemb...
متن کاملMerged-Output HMM for Piano Fingering of Both Hands
This paper discusses a piano fingering model for both hands and its applications. One of our motivations behind the study is automating piano reduction from ensemble scores. For this, quantifying the difficulty of piano performance is important where a fingering model of both hands should be relevant. Such a fingering model is proposed that is based on merged-output hidden Markov model and can ...
متن کاملMinimax Viterbi Algorithm for HMM-Based Guitar Fingering Decision
Previous works on automatic fingering decision for string instruments have been mainly based on path optimization by minimizing the difficulty of a whole phrase that is typically defined as the sum of the difficulties of moves required for playing the phrase. However, from a practical viewpoint of beginner players, it is more important to minimize the maximum difficulty of a move required for p...
متن کاملMAN-MACHINE INTERACTION SYSTEM FOR SUBJECT INDEPENDENT SIGN LANGUAGE RECOGNITION USING FUZZY HIDDEN MARKOV MODEL
Sign language recognition has spawned more and more interest in human–computer interaction society. The major challenge that SLR recognition faces now is developing methods that will scale well with increasing vocabulary size with a limited set of training data for the signer independent application. The automatic SLR based on hidden Markov models (HMMs) is very sensitive to gesture's shape inf...
متن کاملHMM-Based Automatic Arrangement for Guitars with Transposition and its Implementation
Automatic generation of guitar tablatures for given songs has been one of research interests in music information processing. Furthermore, some of recent studies have attempted automatic arrangement of given songs before tablature generation for producing guitar scores for songs composed for other instruments. In our previous work, we have formulated “fingering decision” and “arrangement” in a ...
متن کامل